Euclidean Shortest Paths in Simple Cube Curves at a Glance
نویسندگان
چکیده
This paper reports about the development of two provably correct approximate algorithms which calculate the Euclidean shortest path (ESP) within a given cube-curve with arbitrary accuracy, defined by ε > 0, and in time complexity κ(ε) · O(n), where κ(ε) is the length difference between the path used for initialization and the minimumlength path, divided by ε. A run-time diagram also illustrates this lineartime behavior of the implemented ESP algorithm.
منابع مشابه
Self-Approaching Paths in Simple Polygons
We study self-approaching paths that are contained in a simple polygon. A self-approaching path is a directed curve connecting two points such that the Euclidean distance between a point moving along the path and any future position does not increase, that is, for all points a, b, and c that appear in that order along the curve, |ac| ≥ |bc|. We analyze the properties, and present a characteriza...
متن کاملGeneralized Unfoldings for Shortest Paths in Euclidean 3-Space
The problem of determining shortest paths in the presence of polyhedral obstacles between two points in Euclidean 3-space stems from the general problem of obtaining optimal coliision free paths in robot systems. For the special case when paths are constrained to the surfaces of 3-dimensional objects, simple planar unfoldings are used to obtain the shortest path. For the general case wben paths...
متن کاملShortest Paths in Euclidean Graphs (Extended Abstract)
We analyze a simple method for finding shortest paths in Euclidean graphs (where vertices are points in a Euclidean space and edge weights are distances between points). For many graph models, the running time of the algorithm to find the shortest path between a specified pair of vertices in a graph with V vertices and E edges is shown to be O ( V ) as compared with O(V1ogV + E ) required by th...
متن کاملLecture 5: Simplicial Complex 2-Manifolds, Simplex and Simplicial Complex
Figure 1: Two greatly different curves have a small Hausdroff distance Fréchet distance is a good similarity measurement for curves in Euclidean space. It can be simply described by a daily example. Suppose a dog and its owner are walking along two different paths (curves), connected by a leash. Both of them are moving continuously and forwards only, at any speed or even stop. Then length of th...
متن کاملSingle-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007